Proof theory

Results: 1637



#Item
121Modal logic / Model theory / Non-classical logic / Philosophical logic / Proof theory / Normal modal logic / First-order logic / Propositional calculus / Provability logic / Mathematical logic / Interpretation / Modal companion

Properties of Intuitionistic Provability LogicsRosalie Iemhoff Dick de Jongh Chunlai Zhou

Add to Reading List

Source URL: www.phil.uu.nl

Language: English - Date: 2008-12-12 07:46:31
122Transcendental numbers / Number theory / E / Exponentials / LindemannWeierstrass theorem / Pi / Constructible universe / E-function / SchneiderLang theorem / Auxiliary function

Algebra 2. Teorema di Lindemann-Weierstrass. Roma, gennaio 2010 In this note we present Baker’s proof of the Lindemann-Weierstrass Theorem. Let Q denote the algebraic closure of Q inside C.

Add to Reading List

Source URL: www.mat.uniroma2.it

Language: English - Date: 2010-01-22 06:36:10
123Formal methods / Type theory / Dependently typed programming / Theoretical computer science / Logic in computer science / Coq / Abstract interpretation / CurryHoward correspondence / Predicate transformer semantics / Proof-carrying code / Correctness / Lines of Action

Proof-Carrying Code from Certied Abstract Interpretation and Fixpoint Compression Frédéric Besson and Thomas Jensen and David Pichardie Irisa, Campus de Beaulieu, FRennes, France Abstract

Add to Reading List

Source URL: people.rennes.inria.fr

Language: English - Date: 2014-09-03 04:27:20
124Game theory / Mechanism design / Auctions / Auction theory / Social choice theory / VickreyClarkeGroves auction / Combinatory logic / Auction / Strategyproofness / Monotonicity / Mode / Norm

Characterizing False-name-proof Allocation Rules in Combinatorial Auctions Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, and Yuko Sakurai ∗

Add to Reading List

Source URL: agent.inf.kyushu-u.ac.jp

Language: English - Date: 2016-07-21 01:26:20
125Algebra / Linear algebra / Matrix theory / Determinants / Vehicle registration plates of the Philippines

Linear Algebra 1. A, B are square matrices with A + B = AB. Show that AB = BA . Proof : Let n = order of A. A + B = AB · · · · · · (i)

Add to Reading List

Source URL: www.math.ncu.edu.tw

Language: English - Date: 2007-11-05 20:14:26
126Proof theory / Non-classical logic / Model theory / Philosophical logic / Deductive reasoning / Sequent / Cut-elimination theorem / Soundness / Linear logic / Propositional calculus / First-order logic / Rule of inference

Focused and Synthetic Nested Sequents Kaustuv Chaudhuri, Sonia Marin, and Lutz Straßburger ´ Inria & LIX/Ecole polytechnique, France {kaustuv.chaudhuri,sonia.marin,lutz.strassburger}@inria.fr

Add to Reading List

Source URL: www.lix.polytechnique.fr

Language: English - Date: 2016-01-11 07:50:10
127Automated theorem proving / Logic in computer science / Formal methods / Theoretical computer science / Proof assistants / Automated reasoning / Isabelle / Type theory / Mathematical proof / First-order logic / Theorem / IP

Theory Exploration for Interactive Theorem Proving Moa Johansson Chalmers University of Technology Abstract Theory exploration is an automated reasoning technique for discovering and proving interesting properties about

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2013-09-13 09:25:22
128Automated theorem proving / Proof theory / Symbol / Sequent / Substitution / First-order logic / Hoare logic / Method of analytic tableaux / Polar coordinate system

Dynamic Trace Logic: Definition and Proofs? Bernhard Beckert and Daniel Bruns?? Karlsruhe Institute of Technology, Department of Informatics Abstract. Dynamic logic is an established instrument for program verification a

Add to Reading List

Source URL: formal.iti.kit.edu

Language: English - Date: 2014-03-13 08:30:05
129Mathematical proofs / Proof theory / Methods of proof / Metalogic / Knowledge representation / Tree / Model theory / Natural deduction / Theorem

doi:j.entcs

Add to Reading List

Source URL: ti.arc.nasa.gov

Language: English
130Combinatorial game theory / Mathematical induction / Token coin / Mathematical proof / Mathematical games / Hot game / SpragueGrundy theorem

Take One or Two December 2, 2015 Consider the following game. The board consists of n tokens. At each turn, a player must take either 1 or 2 tokens off the board (which are discarded). The player who takes the last token

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:56
UPDATE